A Takagi Factorization of a Real Symmetric Tridiagonal Matrix

نویسنده

  • Mohamed Elouafi
چکیده

Complex symmetric matrices arise from many applications, such as chemical exchange in nuclear magnetic resonance and power systems. Singular value decomposition (SVD) reveals a great deal of properties of a matrix. A complex symmetric matrix has a symmetric SVD (SSVD), also called Takagi Factorization, which exploits the symmetry [3]. Let A be a complex symmetric matrix, its Takagi factorization has the form:

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Divide-and-Conquer Method for the Takagi Factorization

This paper presents a divide-and-conquer method for computing the Takagi factorization, or symmetric singular value decomposition, of a complex symmetric and tridiagonal matrix. An analysis of accuracy shows that our method produces accurate Takagi values and orthogonal Takagi vectors. Our preliminary numerical experiments have confirmed our analysis and demonstrated that our divide-and-conquer...

متن کامل

A twisted factorization method for symmetric SVD of a complex symmetric tridiagonal matrix

This paper presents an O(n2) method based on the twisted factorization for computing the Takagi vectors of an n-by-n complex symmetric tridiagonal matrix with known singular values. Since the singular values can be obtained in O(n2) flops, the total cost of symmetric singular value decomposition or the Takagi factorization is O(n2) flops. An analysis shows the accuracy and orthogonality of Taka...

متن کامل

On tridiagonal matrices unitarily equivalent to normal matrices

In this article the unitary equivalence transformation of normal matrices to tridiagonal form is studied. It is well-known that any matrix is unitarily equivalent to a tridiagonal matrix. In case of a normal matrix the resulting tridiagonal inherits a strong relation between its superand subdiagonal elements. The corresponding elements of the superand subdiagonal will have the same absolute val...

متن کامل

Parallel Numerical Algorithms for Symmetric Positive Definite Linear Systems

We give a matrix factorization for the solution of the linear system Ax = f , when coefficient matrix A is a dense symmetric positive definite matrix. We call this factorization as "WW T factorization". The algorithm for this factorization is given. Existence and backward error analysis of the method are given. The WDWT factorization is also presented. When the coefficient matrix is a symmetric...

متن کامل

Stability of Block LDLT Factorization of a Symmetric Tridiagonal Matrix

For symmetric indeenite tridiagonal matrices, block LDL T factorization without interchanges is shown to have excellent numerical stability when a pivoting strategy of Bunch is used to choose the dimension (1 or 2) of the pivots.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008